superlinearly convergent exact penalty projected structured hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

we present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step q-superlinear convergence. the approach is based on an adaptive structured scheme due to mahdavi-amiri and bartels of the exact penalty method of coleman and conn for nonlinearly constrained optimization problems. the structured adaptation also makes use of the ideas of nocedal and overton for handling the quasi-newton updates of projected hessians. we discuss the comparative results of the testing of our programs and three nonlinear programming codes from knitro on some randomly generated test problems due to bartels and mahdavi-amiri. the results indeed confirm the practical significance of our special considerations for the inherent structure of the least squares.